High-Level Synthesis of Structured Data Paths

نویسندگان

  • C. Mandal
  • R. M. Zimmer
چکیده

In this paper we present a genetic scheduling algorithm to support the synthesis of structured data paths with the aim of producing designs with a predictable layout structure and conserving on-chip wiring resources. The data path is organized as architectural blocks (A-block) with local functional unit (FU), memory elements and internal interconnections. The A-blocks are interconnected by a few global buses. Our scheduling algorithm delivers the schedule of operations, the A-block in which each operation is scheduled and also the schedule of transfers over the buses, including transfers required to define variables in the basic block which remain live after its execution, all satisfying specified architectural constraints. The make up of the FUs in each A-block in terms of specific implementations of operators from a module database is

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Scheduling Verification in High-Level Synthesis - Implementation of a Normalizer and a Code Motion Verifier

High level synthesis is the process of generating the register transfer level (RTL) design from the behavioral description. The synthesis process consists of several interdependent phases: Preprocessing, Scheduling, Register Allocation and Binding of variables, Control Path and Data Path generation, and Generation of synthesizable Verilog code (RTL). A High-level synthesis tool, called Structur...

متن کامل

Optimal Clock Period for Synthesized Data Paths

For technologies with significant interconnection delays, optimal clock period selection before/during high-level synthesis is not practical. In our approach, we start with a synthesized RTL data path structure, perform place and route and back-annotate the interconnection delays. A set of potentially optimal clock periods are chosen by evaluating 'critical' paths to minimize the dead time asso...

متن کامل

Automatic Synthesis of Time-Stationary Controllers for Pipelined Data Paths

We address the problem of control synthesis for pipelined data paths. Two basic control schemes are possible: datastationary and time-stationary. In this work, we consider the latter approach. We developed an approach to automatically synthesize time-stationarycontrollers for pipelined data paths produced by high level synthesis tools. A highly optimized FSM controller is implemented using eith...

متن کامل

Orthogonal Scan: Low-Overhead Scan for Data Paths

Orthogonal scan paths, which follow the path of the data flow, can be used in data path designs to reduce the test overhead — area, delay and test application time — by sharing functional and test logic. Orthogonal scan paths are orthogonal to traditional scan paths. Judicious ordering of the registers in the orthogonal scan path can allow the scan path to be implemented entirely with existing ...

متن کامل

Distinguished Paper: Automatic Local Memory Architecture Generation for Data Reuse in Custom Data Paths

Traditional high level synthesis is able to yield high computational resource utilisation and short critical paths. The shortcomings of the generated designs usually lies in the memory architecture. To achieve good performance on a FPGA, the data must reside in the fast on-chip memories, but these are commonly too small for the data being processed. Traditional high level synthesis cannot cope ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013